First geolocator tracks of Swedish red-necked phalaropes reveal the Scandinavia-Arabian Sea connection

We studied migration and wintering patterns of a wader with a pelagic lifestyle during the non-breeding period, the rednecked phalarope Phalaropus lobatus . Using light-level geolocation, we obtained three full annual tracks and one autumn migration track of male red-necked phalaropes caught during breeding in Scandinavia. Th ese tracks confi rmed expectations that individuals from the Scandinavian population winter in the Arabian Sea. Migration was accomplished in two to four migration leaps, staging for a few days in the Gulf of Finland (autumn) or the southern Baltic Sea (spring) and for up to a month in or near the Black and Caspian Sea (autumn and spring). In addition, travel speeds suggested that only the fl ights between the Baltic and Black/Caspian Sea are non-stop, and thus the birds seem to make additional short stops during the other flights. Stopover time in the Black/Caspian Sea is only 8 – 10 d in spring but up to 36 d in autumn, which is longer than expected if only used for pre-migratory fattening to cover the ca 2000 km to the Gulf of Oman. After entering the Arabian Sea via the Gulf of Oman, birds dispersed over the entire presumed winter range. Winter movements appear to correspond to the spatio-temporal patterns in primary production linked to seasonally changing monsoon winds. Th ese are not only the first tracks of Scandinavian red-necked phalaropes, but also the fi rst seabird tracks in the Arabian Sea, one of the most productive and dynamic marine areas on the planet

Modular Verification for a Class of PLTL Properties

The verification of dynamic properties of a reactive systems by model-checking leads to a potential combinatorial explosion of the state space that has to be checked. In order to deal with this problem, we define a strategy based on local verifications rather than on a global verification. The idea is to split the system into subsystems called modules, and to verify the properties on each module in separation. We prove for a class of PLTL properties that if a property is satisfied on each module, then it is globally satisfied. We call such properties modular properties. We propose a modular decomposition based on the B refinement process. We present in this paper an usual class of dynamic properties in the shape of G (p -> Q), where `p' is a proposition and `Q' is a simple temporal formula, such as `X q', `F q', or `q U r' (with `q' and `r' being propositions). We prove that these dynamic properties are modular. For these specific patterns, we have exhibited some syntactic conditions of modularity on their corresponding Buchi automata. These conditions define a larger class which contains other patterns such as `G (p -> X (q U r))'. Finally, we show through the example of an industrial Robot that this method is valid in a practical way

Verifying temporal properties using explicit approximants: completeness for context-free processes

We present a sequent calculus for formally verifying modal -calculus properties of concurrent processes. Building on work by Dam and Gurov, the proof system contains rules for the explicit manipulation of fixed-point approximants. We develop a new syntax for approximants, incorporating, in particular, a mechanism for approximant modification. We make essential use of this feature to prove our main result: the sequent calculus is complete for establishing arbitrary -calculus properties of context-free processes

Automatically verifying temporal properties of pointer programs with cyclic proof

We propose a deductive reasoning approach to the automatic verification of temporal properties of pointer programs, based on cyclic proof. We present a proof system whose judgements express that a program has a certain temporal property over memory state assertions in separation logic, and whose rules operate directly on the temporal modal-ities as well as symbolically executing programs. Cyclic proofs in our system are, as usual, finite proof graphs subject to a natural, decidable soundness condition, encoding a form of proof by infinite descent. We present a proof system tailored to proving CTL properties of non-deterministic pointer programs, and then adapt this system to handle fair execution conditions. We show both systems to be sound, and provide an implementation of each in the Cyclist theorem prover, yielding an automated tool that is capable of automatically discovering proofs of (fair) temporal properties of heap-aware programs. Experimental evaluation of our tool indicates that our approach is viable, and offers an interesting alternative to traditional model checking techniques

KORSYS - Korrekte Software fuer sicherheitskritische Systeme. Spezifikation und Verifikation verteilter reaktiver Systeme Schlussbericht

SIGLEAvailable from TIB Hannover: DtF QN1(72,27) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Bildung, Wissenschaft, Forschung und Technologie, Bonn (Germany)DEGerman